Design of High Speed Modulo 2n+1 Adder
نویسندگان
چکیده
The two different architectures for adders are introduced in this paper. The first one is built around a sparse carry computation unit that computes only some of the carries of modulo 2n+1 addition. This sparse approach is enabled by the introduction of inverted circular idem potency property of the parallel-prefix carry operator and its regularity and area efficiency are further enhanced by the introduction of a new prefix operator. The resulting diminished-1 adder can be implemented in a smaller area and consume less power compared to all earlier proposals, maintaining a high operation speed. The second adder architecture unifies the design of modulo 2n+1 adder. Both the adders are derived and compared by using the simulation results.
منابع مشابه
Low-Power Radix-8 Booth Encoded Modulo 2n − 1 Multiplier with Adaptive Delay
A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...
متن کاملDESIGN OF BOOTH ENCODED MODULO 2n-1 MULTIPLIER USING RADIX-8 WITH HIGH DYNAMIC RANGE RESIDUE NUMBER SYSTEM
A special moduli set Residue Number System (RNS) of high Dynamic Range (DR) can speed up the execution of verylarge word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n-1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area and p...
متن کاملPower efficient Simulation of Diminished-One Modulo 2n+1 Adder Using Circular Carry Selection
In this paper we have find great applicability in RNS implementation for the Diminished-one modulo 2n+1 Adder using Circular Carry Selection (CCS) circuit. This adder presents a modulo addition of different bit values for n = 8, 12, 16, 24, 32, 48, 64. We are using the Diminished-one criteria using Circular Carry Selection (CCS) technique for the proposed modulo adder. The circuit design of pro...
متن کاملEfficient VLSI Implementation of Modulo (2^n=B11) Addition and Multiplication
New VLSI circuit architectures for addition and multiplication modulo (2n 1) and (2n + 1) are proposed that allow the implementation of highly efficient combinational and pipelined circuits for modular arithmetic. It is shown that the parallel-prefix adder architecture is well suited to realize fast end-around-carry adders used for modulo addition. Existing modulo multiplier architectures are i...
متن کاملRNS - to - Binary Converter for New Four - Moduli Set { 2 n − 1 , 2 n , 2 n + 1 − 1 , 2 n + 1 + 2 n − 1 } ∗
In this paper, a new four-moduli set {2n − 1, 2n, 2n+1 − 1, 2n+1 + 2n − 1} is proposed. The new moduli set choice because of a fast modulo 2n+1 + 2n − 1 adder has been proposed in literature. In order to work out the reverse converter for this moduli set, we introduce the technique for modulo 2n+1+2n−1 of a negative number and modulo 2n+1+2n−1 multiplication of a residue number by 2 and design ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013